Randomized algorithm

Results: 630



#Item
31Chain minors are FPT Jaroslaw Blasiok1 and Marcin Kami´ nski2 1  Instytut Informatyki

Chain minors are FPT Jaroslaw Blasiok1 and Marcin Kami´ nski2 1 Instytut Informatyki

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English
32I will discuss recent work on randomized algorithms for low-rank approximation and principal component analysis (PCA). The talk will focus on efforts that move beyond the extremely fast, but relatively crude approximatio

I will discuss recent work on randomized algorithms for low-rank approximation and principal component analysis (PCA). The talk will focus on efforts that move beyond the extremely fast, but relatively crude approximatio

Add to Reading List

Source URL: mmds-data.org

Language: English - Date: 2016-06-23 15:50:48
33Literaturverzeichnis  1. Alizadeh, F): A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs. Proceedings of the second ACMSIAM Symposium on Discrete Algorithms 2. Alizade

Literaturverzeichnis 1. Alizadeh, F): A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs. Proceedings of the second ACMSIAM Symposium on Discrete Algorithms 2. Alizade

Add to Reading List

Source URL: www.opt.uni-duesseldorf.de

Language: English - Date: 2003-10-16 08:07:54
34Distributed Computing manuscript No. (will be inserted by the editor) Determining Majority in Networks with Local Interactions and very Small Local Memory George B. Mertzios · Sotiris E. Nikoletseas ·

Distributed Computing manuscript No. (will be inserted by the editor) Determining Majority in Networks with Local Interactions and very Small Local Memory George B. Mertzios · Sotiris E. Nikoletseas ·

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-06-12 12:30:49
35Algorithmica: 67–80 DOI: s00453Algorithmica ©

Algorithmica: 67–80 DOI: s00453Algorithmica ©

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2002-07-02 08:00:25
36Output-Sensitive Construction of the Union of Triangles   Esther Ezra and Micha Sharir School of Computer Science

Output-Sensitive Construction of the Union of Triangles  Esther Ezra and Micha Sharir School of Computer Science

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2007-08-27 22:45:23
37Randomized Algorithms An Introduction through Unique Sink Orientations Lecture Notes Bernd G¨artner, ETH Z¨urich February 13, 2004

Randomized Algorithms An Introduction through Unique Sink Orientations Lecture Notes Bernd G¨artner, ETH Z¨urich February 13, 2004

Add to Reading List

Source URL: people.inf.ethz.ch

Language: English - Date: 2016-06-20 11:55:28
38Early-Deciding Consensus is Expensive Danny Dolev Christoph Lenzen  Hebrew University of Jerusalem

Early-Deciding Consensus is Expensive Danny Dolev Christoph Lenzen Hebrew University of Jerusalem

Add to Reading List

Source URL: people.mpi-inf.mpg.de

Language: English - Date: 2015-05-29 10:12:04
39Spectral Graph Theory  Lecture 11 PSRGs via Random Walks on Graphs Daniel A. Spielman

Spectral Graph Theory Lecture 11 PSRGs via Random Walks on Graphs Daniel A. Spielman

Add to Reading List

Source URL: www.cs.yale.edu

Language: English - Date: 2015-08-17 14:43:26